Trace automaton: an approach to generating partial-order traces

نویسندگان

  • Raj Mohan
  • Srihari Sukumaran
  • Alpana Dubey
چکیده

The trace automaton appears to be a useful tool in generating partially-ordered test cases for asynchronous systems. We give an EXPSPACE algorithm which constructs the trace automaton from a given set of asynchronous communicating processes. Conclusions: We introduce the notion of trace automaton of a system of asyn-chronously communicating input-output state machines such that the trace automaton can be used to derive partially-ordered traces of the system in a straightforward manner. We also give an algorithm for the construction of the trace automaton. The derivation of the traces can be woven into the trace automaton construction, thus enabling the generation of traces " on-the-fly " without constructing the entire trace automaton a-priori. The trace automaton, thus, seems to be useful tool for the generation of the test suites for asynchronous systems. However the algorithm suffers from the state explosion problem. Consequently, in the the worst case, it will take exponential space to generate the entire trace automaton.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Discrete Trace Transition System of a Polyhe-dral Invariant Hybrid Automaton

Supervisory control and fault diagnosis of hybrid systems need to have complete information about the discrete states transitions of the underling system. From this point of view, the hybrid system should be abstracted to a Discrete Trace Transition System (DTTS) and represented by a discrete mode transition graph. In this paper an effective method is proposed for generating discrete mode trans...

متن کامل

The Implementation of Mazurkiewicz Traces in POEM

We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to store trace systems, which allows sharing common prefixes among traces and therefore, reduces memory cost. This structure is easy to extend to incorporate additional features. Two applications are shown in the paper: An ...

متن کامل

A partial-order approach to the verification of concurrent systems: checking liveness properties

Abs t r ac t . We present the foundations of an approach for exploiting the partial ordering of events ,in the verification of concurrent systems. The main objective of the approach is to avoid the state explosion that is due to the use of the standard interleaving semantics of concurrency. The approach has been applied successfully to the verification of complex hardware and software systems s...

متن کامل

Logics for Mazurkiewicz traces

Linear temporal logic (LTL) has become a well established tool for specifying the dynamic behavior of reactive systems with an interleaving semantics and the automatatheoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to understand ...

متن کامل

Deciding LTL over Mazurkiewicz Traces

Linear time temporal logic (LTL) has become a well established tool for specifying the dynamic behaviour of reactive systems with an interleaving semantics, and the automata-theoretic approach has proven to be a very useful mechanism for performing automatic verification in this setting. Especially alternating automata turned out to be a powerful tool in constructing efficient yet simple to und...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006